A branch-and-price algorithm for a team orienteering problem with fixed-wing drones

This paper formulates a team orienteering problem with multiple fixed-wing drones and develops branch-and-price algorithm to solve the optimality. Fixed-wing drones, unlike rotary have kinematic constraints associated them, thereby preventing them make on-the-spot turns restricting minimum turn radius. presents implications of these on drone routing formulation proposes systematic technique address in context problem. Furthermore, novel branching techniques specific imposed due are proposed. Extensive computational experiments benchmark instances corroborating effectiveness algorithms also presented.